A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
In this paper, we &fine a temporal logic for reasoning about Petri nets. We show the model checking probtrbn for this logic to be PTIME equivalent to the Petri net reachability problem. ... Using this lcb~c and two refinements, we show the fair nontermination problem to be PTIME equivalent to reachability for several definitions of fairness. ... All of JanEar's results on NTPj""', NTPfdp-3, and f(Q', GF) may be found in 1193. ...doi:10.1016/0304-3975(91)90228-t fatcat:csbvl7tqczejnjhltalbaocss4
); Yen, Hsu Chun (RC-NTAI-EE) A taxonomy of fairness and temporal logic problems for Petri nets. ... A fair nontermination problem can be reduced to a model checking problem—the problem of deciding whether in a given Petri net there is an infinite firing sequence sat- isfying a given temporal logic formula ...
Rosier and Hsu-Chun Yen, A taxonomy of fairness and tempo- ral logic problems for Petri nets (pp. 351-359); Juraj Hromkovit and Juraj Prochazka, Branching programs as a tool for proving lower bounds on ... Rabinovich and B. A. Trakhtenbrot, Nets of processes and data flow (pp. 574-602); Wolfgang Reisig, Towards a temporal logic for causality and choice in distributed systems (pp. 603-627); J. J. M. M. ...
The issue number is siven in front of the pase numbers) Abadi, M. and L. Lamport, The existence of refinement mappings (Fundamental Study) (2)253-284 Badouel, E. and P. ... Yen, A taxonomy of fairness and temporal logic problems for Petri nets (2) 341-372 Istrate, G., see C. Calude , F. and J.-P. Delahaye, Is there an axiomatic semantics for standard pure Prolog? ... Baeten (2) 285-302 Calude, C. and G. Istrate, Determining and stationary sets for some classes of partial recursive functions (Note) (I) 151-155 Curien, P. ...doi:10.1016/0304-3975(91)90233-r fatcat:wy5cvb45dvbv3bdz2ivoypsg4u
This article surveys various approaches to the formal modeling and analysis of the temporal features of computer-based systems, with a level of detail that is suitable also for non-specialists. ... Then, a significant sample of formalisms for time modeling in computing are presented and discussed according to these dimensions. ... ACKNOWLEDGMENTS We thank the anonymous reviewer for useful suggestions and Gianpaolo Cugola for his comments on an early draft of this paper. ...doi:10.1145/1667062.1667063 fatcat:6bjiukps7bavhontaewdgm7tky
Lecture Notes in Computer Science
Verification problems can be reduced to checking behavioural equivalence or implementation (simulation) relations, or to checking the satisfaction of properties described in temporal logics or fixpoint ... This requires rigorous methods and techniques to conceive, analyze and validate these systems. The verification problem consists in checking whether a system satisfies its specification. ... of CRP and Petri nets with respect to bisimulation. ...doi:10.1007/978-3-540-45220-1_7 fatcat:4j5lzdbfc5hd7ptdo4tpwvmd2m
2009 7th IEEE International Conference on Industrial Informatics
This paper gives a first evaluation for the suitability of models for engineering DCSs to provide the researcher and practitioner with combinations of models that are well suited for their engineering ... There is a wide range of modeling approaches available from traditional automation, domain-oriented systems engineering, and software engineering. ... This is due to the comparability problems of strongly different model types and the problem to provide a fair rating with more levels for differentiation. ...doi:10.1109/indin.2009.5195844 fatcat:iia5w6rjlnggxe4z2rtjmz5xhq
ACKNOWLEDGMENTS This report has benefited from helpful comments from Chris Hankin, Michael Loui, Jack Stankovic, and Peter Wegner. ... PEP [Margaria and Steffen 1996] allows the automatic analysis of Petri-net-based systems. ... systems satisfy temporal formulas as well as a decision procedure for temporal logic and a model checker; and PAM [Lin 1991 ], which oversees the construction of algebraic proofs of equivalence between ...doi:10.1145/242223.242252 fatcat:4gu2wurduveqdhqqrhr27yaqjq
Yen, A taxonomy of fairness and temporal logic problems for Petri nets 82 (2) (1991) 341-372 Hromkovic, J.,seeP. ... Rosier, Problems concerning fairness and temporal logic for conflict-free Petri nets 64 (3) ( 1989) 305-329 Howell, R.R., L.E. Rosier and H.-C. ...doi:10.1016/0304-3975(92)90292-n fatcat:ekwes6owtrco3lkfkiqagnketq
The proposed framework is independent of any existing formalism, and provides a conceptually rich and exhaustive ontology and semantics of norms needed for business process compliance checking. ... This paper presents an abstract framework consisting of a list of norms and a generic compliance checking approach on the idea of (possible) execution of processes. ... NICTA is funded by the Australian Government as represented by the Department of Broadband, Communications and the Digital Economy and the Australian Research Council through the ICT Center of Excellence ...doi:10.1007/s10796-015-9558-1 fatcat:q6kdaykc4rezpdzdswisq6yohy
These advancements are all essential for improving controls: faster communications help to detect problems early to prevent or limit damages, secure and reliable communications reduce tempering of control ... The vision of the research is a the other side, threats of frauds, terrorism, epidemic diseases, etc. ask for more controls, making trade procedures more cumbersome and spoiling the efforts of trade facilitation ... The formalism combines elements of deontic logic, temporal logic, action logic, and Petri nets. ...doi:10.2139/ssrn.2051695 fatcat:yggj4yyajvdmjapwuoxtxayowq
Manually building logical specifications, which are regarded as a set of temporal logic formulas, seems to be a significant obstacle for an inexperienced user when applying the deductive approach. ... The main idea behind the approach is to consider patterns, defined in terms of temporal logic, as a kind of (logical) primitives which enable the transformation of models to temporal logic formulas constituting ... Acknowledgment The author wishes to thank the anonymous reviewers for their valuable comments that helped to improve the work. ...doi:10.2478/amcs-2014-0069 fatcat:jxxecgy7lzdlbnt7ye7vqy6tca
of an inventory, 3345 undecidability of the boundedness problem, 859 code problem for traces, 3419 common ancestor problem, 406 equality problem of tiring sequences for Petri nets, 56 undecidability ... of the -, 154 tautology testing, 154. 244 taxonomy of event oriented processes, 1678 fairness, 1547 Tay. ...doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm
Lecture Notes in Computer Science
And second, it summarizes some of the open questions and issues related to object interoperability, in order to set the basis for further research activities. ... First, it tries to provide a snapshot of some of the current research being carried out within the object-oriented community in these areas. ... Concluding Remarks If a main goal of a workshop is to gather researchers and practitioners of a discipline, and let them exchange ideas, identify problems, and reach (violent:) agreements, we are pretty ...doi:10.1007/3-540-44555-2_18 fatcat:okgp2srgvjcq3hfr5dpb4txmpm
Yen, Global and local views of state fairness Howell, R.R., L.E. Rosier and H.-C. Yen, A taxonomy of fairness and temporal logic problems for Petri ., S.A. Loikin, A.I. Rybko, A.A. Sapofenko and N.A. ... Rosier, Problems concerning fairness and temporal logic for conflict-free Petri nets 64 (3) (1989) 305-329 Howell, R.R., L.E. Rosier and H.-C. ...doi:10.1016/s0304-3975(98)00321-1 fatcat:5wscxtd3qfdyrcvnx3dvavfb6i
« Previous Showing results 1 — 15 out of 417 results