150 search results - page 18 / 30 » Counting Results in Weak Formalisms |
CONCUR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We present an encoding for (bound) processes of the asynchronous CCS with replication into open Petri nets: ordinary Petri nets equipped with a distinguished set of open ...
WSFM
2007
Springer
14 years 2 months ago
2007
Springer
We present and compare existing formalisms that consider the control of Petri net process models in the area of business processes and web services. Control has the aim to force a ...
APLAS
2005
ACM
14 years 2 months ago
2005
ACM
Message Sequence Charts (MSCs) are a graphical language for the description of scenarios in terms of message exchanges between communicating components in a distributed environment...
CAV
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In predicate abstraction, exact image computation is problematic, requiring in the worst case an exponential number of calls to a decision procedure. For this reason, sof...
WOLLIC
2010
Springer
14 years 1 months ago
2010
Springer
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...