Basic notions of trace theory

Mazurkiewicz, Antoni

doi:10.1007/bfb0013025

Cited by 144 publications

(79 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concurrency is handled in terms of the actions themselves, and there is no need for all actions within a transaction to be independent (and isolated). This is one of the benefits of opting for a noninterleaving semantics, based on [10], [12], as it allows modelling true-concurrency between actions in a longrunning transaction.…”

Section: Discussionmentioning

confidence: 99%

“…Our approach towards modelling concurrent actions, actions that can happen in parallel, draws upon the concepts in Shields' vector languages [10] and Mazurkiewicz trace languages [12] where concurrent events are considered as being unordered, in contrast to CSP trace theory where it is assumed that observations are sequential in nature and concurrent events are understood to occur in either order (nondeterministic interleaving).…”

Section: B Parallel Service Compositionsmentioning

confidence: 99%

See 1 more Smart Citation

Long-running Transactions: Semantics, schemas, implementation

Moschoyiannis

Razavi

Zheng

et al. 2008

2008 2nd IEEE International Conference on Digital Ecosystems and Technologies

View full text Add to dashboard Cite

Abstract-In this paper we describe a formal model for the distributed coordination of long-running transactions in a Digital Ecosystem for business, involving Small and Medium Enterprises (SMEs). The proposed non-interleaving model of interaction-based service composition allows for communication between internal activities of transactions. The formal semantics of the various modes of service composition are represented by standard xml schemas. The current implementation framework uses suitable asynchronous message passing techniques and reflects the design decisions of the proposed model for distributed transactions in digital ecosystems.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: B Parallel Service Compositionsmentioning

confidence: 99%

Long-running Transactions: Semantics, schemas, implementation

Moschoyiannis

Razavi

Zheng

et al. 2008

2008 2nd IEEE International Conference on Digital Ecosystems and Technologies

View full text Add to dashboard Cite

show abstract

“…[16,19]) which reduces the number of states to be considered during model checking, parallelized interleaving does not avoid certain computation paths or states, but combines their traversal into one symbolic step and thus accelerates state space traversal. Consider a TA T composed from n components T A 1 , .…”

Section: Introductionmentioning

confidence: 99%

Fully Symbolic Model Checking for Timed Automata

Morbé

Pigorsch

Scholl

2011

Computer Aided Verification

View full text Add to dashboard Cite

Abstract. In this paper we introduce a new formal model, called finite state machines with time (FSMT), to represent real-time systems. We present a model checking algorithm for FSMTs, which works on fully symbolic state sets containing both the clock values and the state variables. In order to verify timed automata (TAs) with our model checking algorithm, we present two different methods to convert TAs to FSMTs. In addition to pure interleaving semantics we can convert TAs to FSMTs having a parallelized interleaving behavior which allows parallelism of transitions causing no conflicts. This can dramatically reduce the number of steps during verification. Our experimental results show that our prototype implementation outperforms the state-of-the-art model checkers UPPAAL and RED.

show abstract

“…The basic idea is to include in your notion of equivalence some information of causal dependency between events, following the ideas from the theory of Petri nets and Mazurkiewicz traces [26,19]. For finite-state systems non-interleaving equivalences are computationally at least as hard as interleaving equivalences, see [14,18].…”

Section: Introductionmentioning

confidence: 99%

Behavioural Equivalence for Infinite Systems—Partially Decidable!

Nielsen¹,

Sunesen²

1995

BRICS

View full text Add to dashboard Cite

For finite-state systems non-interleaving equivalences are computationally at least as hard as interleaving equivalences. In this paper we show that when moving to infinite-state systems, this situation may change dramatically.We compare standard language equivalence for process description languages with two generalizations based on traditional approaches capturing non-interleaving behaviour, pomsets representing global causal dependency, and locality representing spatial distribution of events.We first study equivalences on Basic Parallel Processes, BPP, a process calculus equivalent to communication free Petri nets. For this simple process language our two notions of non-interleaving equivalences agree. More interestingly, we show that they are decidable, contrasting a result of Hirshfeld that standard interleaving language equivalence is undecidable. Our result is inspired by a recent result of Esparza and Kiehn, showing the same phenomenon in the setting of model checking.We follow up investigating to which extent the result extends to larger subsets of CCS and TCSP. We discover a significant difference between our non-interleaving equivalences. We show that for a certain non-trivial subclass of processes between BPP and TCSP, not only are the two equivalences different, but one (locality) is decidable whereas the other (pomsets) is not. The decidability result for locality is proved by a reduction to the reachability problem for Petri nets.

show abstract

Basic notions of trace theory

Cited by 144 publications

References 31 publications

Long-running Transactions: Semantics, schemas, implementation

Long-running Transactions: Semantics, schemas, implementation

Fully Symbolic Model Checking for Timed Automata

Behavioural Equivalence for Infinite Systems—Partially Decidable!

Contact Info

Product

Resources

About