For a strongly connected Extended-Free-Choice Net (EFC-net) N the algorithm given in this paper either nds a cover of S-components or recognizes that N is not well-formed. Well-formedness denotes the existence of a live and bounded marking for N. The algorithm is also adaptable to compute a cover of T-components. The time complexity is O(jPjjTj). According to the Rank Theorem, nding a cover of ...

the distribution of the allophones of /?/in certain contexts involves free variation and gradient preferences. an organized survey was conducted to elicit the judgments of 37 native persian speakers concerning the well-formedness of /?/allophonic behavior in five different phonological positions. the results showed that the differences in judgment between the various categories are not just t...

Contract languages such as JML and Spec# specify invariants and preand postconditions using side-effect free expressions of the programming language, in particular, pure methods. For such contracts to be meaningful, they must be well-formed: First, they must respect the partiality of operations, for instance, the preconditions of pure methods used in the contract. Second, they must enable a con...

The cognitively based knowledge representation introduced in this paper enables specifications obtained in elicitation processes as well as the processes themselves to be verified for wellformedness from a semiotic point of view. By simultaneously elaborating objectand meta-level interpretations of a problem, the proposed theory may help speed up requirement elicitation thereby increase its eff...

We show how the two main characteristics of the ILLICO natural language interface-guided composition mode by partial synthesis, and the modularity of the encoding of li,aguistic knowledge specifying the lexical, syntactic, semantic and conceptual levels of well-formedness-have lead us to develop an approach and a system in which all the constraints on the different levels of well-formedness are...

Martin-Löf’s type theory exists in two forms, differing in the formalisation of the identity types. In [15] Per Martin-Löf formulated his type theory with the extensional rules for the identity types, identifying judgmental and propositional equality. This rendered type-checking and well-formedness of formulas undecidable. For this reason (among others), he latter formulated intensional rules f...